Axiomatizing Groenendijk’s Logic of Interrogation

نویسندگان

  • Balder ten Cate
  • Chung-chieh Shan
  • Jeroen Groenendijk
چکیده

Jeroen Groenendijk (1999, reprinted in this book) introduced a logic, which he called the Logic of Interrogation (henceforth LoI), that can be used to analyze which linguistic answers are appropriate in response to a given question. Groenendijk gave only a semantic definition of his logic. For practical applications like building question-answering systems, however, we also need to understand the proof theory of this logic (Monz, 2003b, Section 2.4). A better understanding of the proof theory of LoI also enables us to better grasp the empirical predictions made by the model. In this chapter, we bridge this gap, by providing a sound and complete axiomatization for LoI. Furthermore, we will show that the entailment relation of LoI is closely related to the model-theoretic notion of definability. Roughly speaking, the question Who came to the party? entails the question Did anybody come to the party? in LoI because the proposition that someone came to the party is definable in terms of the property of having come to the party (in the same way that the first-order sentence ∃x.Px is definable in terms of the property P ). This connection between question entailment and definability also shows up in the fact that an answer to a natural-language question is typically built up from instances of the question.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relevance-Based Partition Semantics for Why-Questions

This work argues that partition semantics can be extended to cover whyquestions and their answers, and then develops such an extension. Building on Jeroen Groenendijk’s Logic of Interrogation and incorporating a theory of why-questions initially put forward by Bas van Fraassen, it provides a unified notion of contextual answerhood for both why-questions and constituent questions. Non-constructi...

متن کامل

Axiomatizing first order consequences in dependence logic

Dependence logic, introduced in [8], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem.

متن کامل

Axiomatizing first-order consequences in independence logic

Independence logic, introduced in [5], cannot be effectively axiomatized. However, first-order consequences of independence logic sentences can be axiomatized. In this article we give an explicit axiomatization and prove that it is complete in this sense. The proof is a generalization of the similar result for dependence logic introduced in [8].

متن کامل

Axiomatizing Mathematical Theories: Multiplication

Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some mathematical structures are now classical theorems in Logic, Algebra and Geometry. In this paper we will study the axiomatizability of the theories of multiplication i...

متن کامل

Axiomatizing Propositional Dependence Logics

We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006